A geometric nonuniform fast Fourier transform

An efficient algorithm is presented for the computation of Fourier coefficients of piecewise-polynomial densities on flat geometric objects in arbitrary dimension and codimension. Applications range from standard nonuniform FFTs of scattered point data, through line and surface potentials in two and three dimensions, to volumetric transforms in three dimensions and higher. Input densities are smoothed with a Bspline kernel, sampled on a uniform grid, and transformed by a standard FFT, and the resulting coefficients are unsmoothed by division. Any specified accuracy can be achieved, and numerical experiments demonstrate the efficiency of the algorithm for a gallery of realistic examples.